翻訳と辞書 |
Package-merge algorithm : ウィキペディア英語版 | Package-merge algorithm The package-merge algorithm is an ''O(nL)''-time algorithm for finding an optimal length-limited Huffman code for a given distribution on a given alphabet of size ''n'', where no code word is longer than ''L''. It is a greedy algorithm, and a generalization of Huffman's original algorithm. Package-merge works by reducing the code construction problem to the binary coin collector's problem.〔L. L. Larmore and D. S. Hirschberg. A fast algorithm for optimal length-limited Huffman codes. Journal of the Association for Computing Machinery, V 37 No. 3:464--473, 1990.〕 ==The coin collector's problem== Suppose a coin collector has a number of coins of various denominations, each of which has a numismatic value unrelated to its denomination. The coin collector has run out of money and needs to use some of his coin collection to buy something of cost ''N''. He wishes to select a subset of coins from his collection of minimum numismatic value whose denominations total ''N''. The binary version of this problem is that all denominations are powers of 2, that is, 1, 1/2, 1/4, etc. dollars.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Package-merge algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|